Conjugate symplecticity of second-order linear multi-step methods

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Explicit Two-Step Methods for Second-Order Linear IVPs

we present a new type of method for the integration of systems of linear inhomogeneous initial value problems with constant coefficients. Our methods are of hybrid explicit Numerov type. The methods are constructed without the intermediate use of high accuracy interpolatory nodes, since only the Taylor expansion at the internal points is needed. Then we derive the order conditions taking advant...

متن کامل

On the stability of linear differential equations of second order

The aim of this paper is to investigate the Hyers-Ulam stability of the  linear differential equation$$y''(x)+alpha y'(x)+beta y(x)=f(x)$$in general case, where $yin C^2[a,b],$  $fin C[a,b]$ and $-infty

متن کامل

Explicit multi-step peer methods for special second-order differential equations

The construction of s-stage explicit twoand three-step peer methods of order p = 2s and p = 3s is considered for the solution of non-stiff second order initial value problems where the right-hand side does not depend on y. By additional conditions superconvergence of order p + 1 can be achieved. Further criteria for good methods are large stability intervals and small error constants. Numerical...

متن کامل

Semismooth Methods for Linear and Nonlinear Second-order Cone Programs

The optimality conditions of a nonlinear second-order cone program can be reformulated as a nonsmooth system of equations using a projection mapping. This allows the application of nonsmooth Newton methods for the solution of the nonlinear second-order cone program. Conditions for the local quadratic convergence of these nonsmooth Newton methods are investigated. Related conditions are also giv...

متن کامل

Linear Second-order Uniication ?

We present a new class of second-order uniication problems, which we have called linear. We deal with completely general second-order typed uniication problems, but we restrict the set of uniiers under consideration: they instantiate free variables by linear terms, i.e. terms where any-abstractions bind one and only one occurrence of a bound variable. Linear second-order uniication properly ext...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Computational and Applied Mathematics

سال: 2007

ISSN: 0377-0427

DOI: 10.1016/j.cam.2006.02.042